Programa de melhorias e treinamentos implantados na construção civil: um estudo de caso

Dissertação (Mestrado) - Universidade Federal de Santa Catarina, Centro Tecnológico

Teacher competences for active learning in engineering education

The implementation of active learning strategies in engineering education still encounters barriers when facing conventional teaching-learning practices. This work aims to contribute to the discussion on teachers’ pedagogical competences required for active learning. This contribution is developed from the perceptions of 205 engineering teachers of Brazilian higher education institutions, centered on significant teaching competences necessary for teachers of engineering courses and how to develop them in the active learning context. The results show that essential competences identified by the participants are (I) teamwork (teachers’ cooperation); (II) teacher–student relationships (empathy); (III) feedback about students’ performance throughout the learning process; (IV) information and communication technology (ICT) competences; (V) selecting and adapting the teaching-learning methodologies to the class context; and (VI) creativity. A complementary logistic regression model suggested that female Ph.D. full-time teachers are more likely to employ active learning. Differences in active learning adoption among Brazilian regions were also captured by the model. The identified competences are essential for the sustainability of the innovation of teaching practices in the context of active learning, which may be used to inform more effective professional training of engineering teachers in the current globalized scenario.This research was funded by the Brazilian National Council for Scientific and Technological Development (CNPq), grant number 205430/2014-7. This work was partially supported by FCT— Fundação para a Ciência e Tecnologia within the R&D Units Project Scope UIDB/00319/2020

Proof theory for hybrid(ised) logics

Hybridisation is a systematic process along which the characteristic features of hybrid logic, both at the syntactic and the semantic levels, are developed on top of an arbitrary logic framed as an institution. In a series of papers this process has been detailed and taken as a basis for a specification methodology for reconfigurable systems. The present paper extends this work by showing how a proof calculus (in both a Hilbert and a tableau based format) for the hybridised version of a logic can be systematically generated from a proof calculus for the latter. Such developments provide the basis for a complete proof theory for hybrid(ised) logics, and thus pave the way to the development of (dedicated) proof support.The authors are grateful to Torben Bräuner for helpful, inspiring discussions, and to the anonymous referees for their detailed comments. This work is funded by ERDF—European Regional Development Fund, through the COMPETE Programme, and by National Funds through Fundação para a Ciência e a Tecnologia(FCT) within project PTDC/EEI-CTP/4836/2014. Moreover, the first and the second authors are sponsored by FCT grants SFRH/BD/52234/2013 and SFRH/BPD/103004/2014, respectively. M. Mar-tins is also supported by the EU FP7 Marie Curie PIRSES-GA-2012-318986 project GeTFun: Generalizing Truth-Functionality and FCT project UID/MAT/04106/2013 through CIDMA. L.Barbosa is further supported by FCT in the context of SFRH/B-SAB/113890/2015

A Logic for robotics?

This paper introduces HHL, a hierarchical variant of hybrid logic. First-order correspondence and a Hennessy-Milner like theorem relating (hierarchical) bisimulation and logical equivalence for HHLare presented. Combining hierarchical transition structures with the ability to refer to specific states at any level of description, this logic seems suitable to express and verify properties of hierarchical transition systems, a pervasive semantic structure in Computer Science.Dynamic logic combines logic with programs, which at a certain level of abstraction, can be regarded as behaviours changing the system state and, therefore, the truth value of formulas. This paper suggests a method for generating such logics for the domain of robot controllers and illustrates it with a logic for handling resource consumption

Introducing hierarquical hybrid logic

This paper introduces HHL, a hierarchical variant of hybrid logic. First-order correspondence and a Hennessy-Milner like theorem relating (hierarchical) bisimulation and logical equivalence for HHL are presented. Combining hierarchical transition structures with the ability to refer to specific states at any level of description, this logic seems suitable to express and verify properties of hierarchical transition systems, a pervasive semantic structure in Computer Science

When even the interface evolves ...

This paper extends the authors’ previous work on a formal approach to the specification of reconfigurable systems in which configurations are taken as local states in a suitable transition structure. The novelty is the explicit consideration that not only the realisation of a service may change from a configuration to another, but also the set of services provided and even their functionality, may themselves vary. In other words, interfaces may evolve, as well.FC

Giving ALLOY a family

Lightweight formal methods ought to provide to the end user the rigorousness of mathematics, without compromising simplicity and intuitiveness. ALLOY is a powerful tool, particularly successful on this mission. Limitations on the verification side, however, are known to prevent its wider use in the development of safety or mission critical applications. A number of researchers proposed ways to connect Alloy to other tools in order to meet such challenges. This paper’s proposal, however, is not establishing a link from ALLOY to another single tool, but rather to “plunge” it into the HETS network of logics, logic translators and provers. This makes possible for Alloy specifications to “borrow” the power of several, non dedicated proof systems. Semantical foundations for this integration are discussed in detail.FC

An institution for Alloy and its translation to second-order logic

Publicado em "Integration of reusable systems". ISBN 978-3-319-04716-4Lightweight formal methods, of which Alloy is a prime example, combine the rigour of mathematics without compromising simplicity of use and suitable tool support. In some cases, however, the verification of safety or mission critical software entails the need for more sophisticated technologies, typically based on theorem provers. This explains a number of attempts to connect Alloy to specific theorem provers documented in the literature. This chapter, however, takes a different perspective: instead of focusing on one more combination of Alloy with still another prover, it lays out the foundations to fully integrate this system in the Hets platform which supports a huge network of logics, logic translators and provers. This makes possible for Alloy specifications to “borrow” the power of several, non dedicated proof systems. The chapter extends the authors’ previous work on this subject by developing in full detail the semantical foundations for this integration, including a formalisation of Alloy as an institution, and introducing a new, more general translation of the latter to second-order logic.(undefined

Occurrence of anurans in brazilian caves

Brazil has the greatest diversity of anurans and also one of the greatest speleological patrimonies in the world. However, informations about anurans in Brazilian caves including different biomes and lithologies are scarce. This study sampled 223 caves divided into different biomes (Amazon, Atlantic Forest, Caatinga, Cerrado and transition area) and lithologies (Conglomerate, Granite, Iron-ore, Limestone, Marble, Quartzite, and Sandstone) distributed in eleven Brazilian states. To determine the anuran composition (presence/absence), a single sampling event was conducted in each cave by a team of three researchers in the period 1999−2011, following acoustic and visual search methods. We recorded 54 species distributed 18 genera and 11 families. The caves in the Amazon biome had the highest number of species, followed by caves present in the Cerrado, Caatinga, transition area (Atlantic Forest and Cerrado) and the Atlantic Forest. The caves in the Iron-ore lithology had the highest number of species, followed by the Limestone, Sandstone, Quartzite, Granite, Marble and Conglomerate caves. The anurans proved to be very diverse in Brazilian caves, with this high species richness related to the large amount of biomes and lithologies sampled. The family Leiuperidae had the highest richness and the species Scinax fuscovarius the highest frequency of occurrence in the caves. Also recorded were tadpoles and immature forms inside caves suggesting that not all the species are accidental, and that some species may be using these environments for shelter, protection, food and, even reproduction

An exercise on the generation of many-valued dynamic logics

In the last decades, dynamic logics have been used in different domains as a suitable formalism to reason about and specify a wide range of systems. On the other hand, logics with many-valued semantics are emerging as an interesting tool to handle devices and scenarios where uncertainty is a prime concern. This paper contributes towards the combination of these two aspects through the development of a method for the systematic construction of many-valued dynamic logics. Technically, the method is parameterised by an action lattice that defines both the computational paradigm and the truth space (corresponding to the underlying Kleene algebra and residuated lattices, respectively)